Short Monadic Second Order Sentences about Sparse Random Graphs
نویسندگان
چکیده
منابع مشابه
Spectra of Monadic Second Order Sentences Sh817
For a monadic sentence ψ in the finite vocabulary we show that the spectra, the set of cardinalities of models of ψ is almost periodic under reasonable conditions. The first is that every model is so called “weakly k-decomposable”. The second is that we restrict ourselves to a nice class of models constructed by some recursion. This research was supported by the Israel Science Foundation I woul...
متن کاملMonadic Second Order Asymptotics on Random Acyclic Graphs
We classify the vertices of trees, and use a primitive Poisson approximation argument to prove that almost all trees have almost the same proportion of vertices of each kind. We use a graph surgery construction to investigate the asymptotic probabilities of order-invariant Monadic Second Order (with built-in linear ordering) queries over random free trees, proving that for any MSO query , the p...
متن کاملProbabilities of Sentences about Very Sparse Random Graphs
W e consider random graphs with edge probability Pn-Q, where n is the number of vertices of the graph, /3 > 0 is fixed, and a = 1 or a = (I + 1)/1 for some fixed positive integer I . We prove that for every firstorder sentence, the probability that the sentence is true for the random graph has an asymptotic limit. Also, there is an eflective procedure for generating the value of the limit in cl...
متن کاملCircle graphs and monadic second-order logic
A circle graph is the intersection graph of a set of chords of a circle. If a circle graph is prime for the split (or join) decomposition defined by Cunnigham, it has a unique representation as a set of intersecting chords, and we prove that this representation can be defined by monadic second-order formulas. By using the (canonical) split decomposition of a circle graph, one can define in mona...
متن کاملThe monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quanti*cations
We consider the class USk of uniformly k-sparse simple graphs, i.e., the class of *nite or countable simple graphs, every *nite subgraph of which has a number of edges bounded by k times the number of vertices. We prove that for each k, every monadic second-order formula (intended to express a graph property) that uses variables denoting sets of edges can be e7ectively translated into a monadic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2018
ISSN: 0895-4801,1095-7146
DOI: 10.1137/16m1103105